Number Theoretic Transforms for Fast Digital Computation
نویسندگان
چکیده
منابع مشابه
Faster arithmetic for number-theoretic transforms
We show how to improve the efficiency of the computation of fast Fourier transforms over Fp where p is a word-sized prime. Our main technique is optimisation of the basic arithmetic, in effect decreasing the total number of reductions modulo p, by making use of a redundant representation for integers modulo p. We give performance results showing a significant improvement over Shoup’s NTL library.
متن کاملNumber-theoretic transforms of prescribed length
A new constructive method for finding all convenient moduli m for a number-theoretic transform with given length N and given primitive Nth root of unity modulo m is presented. This method is based on the prime factorization of cyclotomic polynomials with integer-valued argument or on the primitive divisors of integers. Many known results can be obtained as simple corollaries.
متن کاملA fast algorithm for linear least-squares smoothing and boundary value problems using number-theoretic transforms
A fast algorithm for linear least-squares smoothing and boundary value problems using number-theoretic transforms (NTT) is presented. The algorithm utilizes the fact that the fixed interval smoother can be imbedded in a boundary value problem, which can be reformulated as a problem of solving a perturbed-circulant system of equations. The new algorithm solves this perturbed-circulant system of ...
متن کاملA New Algorithm for Fast Full Search Block Motion Estimation Based on Number Theoretic Transforms
A new fast full search algorithm for block motion estimation is presented, which is based on convolution theorem and number theoretic transforms. It can be used with common video coding standards such as H.263 and MPEG. The algorithm applies the sum of squared differences (SSD) criterion, and the encoded video quality is equivalent or even better than what is achieved with conventional methods,...
متن کاملFast algorithms for 2-D circular convolutions and number theoretic transforms based on polynomial transforms over finite rings
In this paper, we develop new fast algorithms for 2-D integer circular convolutions and 2-D number theoretic transforms (NTT). These new algorithms, which offer improved computational complexity, are constructed based on polynomial transforms over 2, ; these transforms are Fourier-like transforms over Z1,[.r], which is the integral domain of polynomial forms over Z,. Having defined such polynom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Advent Technology
سال: 2019
ISSN: 2321-9637
DOI: 10.32622/ijrat.752019106